github.com/andybalholm/brotli.blockEncoder.histogram_length_ (field)

13 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L999: 	histogram_length_ uint
		brotli_bit_stream.go#L1026: 	self.histogram_length_ = histogram_length
		brotli_bit_stream.go#L1066: 		self.entropy_ix_ = uint(block_type) * self.histogram_length_
		brotli_bit_stream.go#L1097: 		var ix uint = histo_ix*self.histogram_length_ + symbol
		brotli_bit_stream.go#L1103: 	var table_size uint = histograms_size * self.histogram_length_
		brotli_bit_stream.go#L1117: 			var ix uint = i * self.histogram_length_
		brotli_bit_stream.go#L1118: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1124: 	var table_size uint = histograms_size * self.histogram_length_
		brotli_bit_stream.go#L1138: 			var ix uint = i * self.histogram_length_
		brotli_bit_stream.go#L1139: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1145: 	var table_size uint = histograms_size * self.histogram_length_
		brotli_bit_stream.go#L1159: 			var ix uint = i * self.histogram_length_
		brotli_bit_stream.go#L1160: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)